Visual-MCM: Visualising Execution Histories on Multiple Memory Consistency Models
نویسندگان
چکیده
The behaviour of Distributed Shared Memory Systems is dictated by the memory consistency model. In order to provide a better understanding on the semantics of the memory models, many researchers have proposed formalisms to deene them. Even with formal deenitions, it is still diicult to say what kind of execution histories can be produced on a particular memory model. In this paper, we propose Visual-MCM, a visualisation tool that shows what operations orderings could lead to user-deened execution histories on diierent memory models. We also present a prototype of Visual-MCM that analyses execution histories for two diierent memory consistency models.
منابع مشابه
Defining Hybrid Distributed Shared Memory Consistency Models on Unified Framework
DSM (Distributed Shared Memory) system combines the advantages of shared memory parallel computer and distributed system. The value of DSM is depended upon the performance of MCM (Memory consistency Model). Lots of Consistency Model are defined by a wide variety of source including architecture system, application programmer etc. But basically it is combined in two types: uniform model and hybr...
متن کاملFrom Causal Consistency to Sequential Consistency in Shared Memory Systems
Sequential consistency and causal consistency constitute two of the main consistency criteria used to deene the semantics of accesses in the shared memory model. An execution is sequentially consistent if all processes can agree on a same legal sequential history of all the accesses; if processes perceive distinct legal sequential histories of all the accesses, the execution is only causally co...
متن کاملThe effects of memory-access ordering on multiple-issue uniprocessor performance
We study the effect of memory access ordering policies on processor performance. Relaxed ordering policies increase available instruction-level parallelism, but such policies must be evaluated subject to their effect on memory consistency — since virtually all microprocessors are designed to be compatible with shared memory multiprocessor systems, even uniprocessor desktop computers are constra...
متن کاملFast and Generalized Polynomial Time Memory Consistency Verification
The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist that detect almost all failures in such execution. These are often used in practice for microprocessor verification. We present a low complexity and fully parallelized algorithm to check program execution against the pr...
متن کاملEstablishing Causality as a Desideratum for Memory Models and Transformations of Parallel Programs
In this paper, we establish a notion of causality that should be used as a desideratum for memory models and code transformations of parallel programs. We introduce a Causal Acyclic Consistency (CAC) model which is weak enough to allow various useful code transformations, yet still strong enough to prevent any execution that exhibits “causal cycles” that may be caused by the Java Memory Model (...
متن کامل